There is no universal countable pentagon-free graph

نویسندگان

Gregory L. Cherlin

Péter Komjáth

چکیده

No countable C,-free graph contains every countable C,-free graph as a subgraph, for n 2 4. For n = 4, this was proved earlier by J. Pach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

There is no universal countable random-free graph

We consider embeddings between infinite graphs. In particular, We establish that there is no universal element in the class of countable graphs into which the random graph is not embeddable.

متن کامل

Universal graphs with a forbidden subtree

The systematic investigation of countable universal graphs with “forbidden” subgraphs was initiated in [13], followed by [12]. If C is a finite connected graph, then a graph G is C-free if it contains no subgraph isomorphic to C. A countable C-free graph G is weakly universal if every countable C-free graph is isomorphic to a subgraph of G, and strongly universal if every such graph is isomorph...

متن کامل

A Universal Structure for Jv-free Graphs

Countable homogeneous graphs have been classified by Alistair Lachlan and Robert Woodrow [5,11]. There is a countable bipartite graph called the universal 'homogeneous' bipartite graph. However, this graph does not occur in Lachlan and Woodrow's list, because it is not homogeneous as a graph but only as a graph with a fixed bipartition (Cameron [1]). In this paper, I describe a graph which is a...

متن کامل

Universal Graphs without Large Cliques

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

متن کامل